A remark about a Galerkin method

A remark about factorizing GCD-type Hyperdeterminants

We show that a very elementary trick allows to generalize a theorem of Linström to higher determinants. As a special case, one recovers some results due to Lehmer and Haukkannen on hyperdeterminants of GCD matrices.

A remark about orthogonal matching pursuit algorithm

In this note, we investigate the theoretical properties of Orthogonal Matching Pursuit (OMP), a class of decoder to recover sparse signal in compressed sensing. In particular, we show that the OMP decoder can give (p, q) instance optimality for a large class of encoders with 1 ≤ p ≤ q ≤ 2 and (p, q) 6= (2, 2). We also show that, if the encoding matrix is drawn from an appropriate distribution, ...

A Remark about Combings of Groups

In the last several years a remarkable interplay between geometry, group theory, and the theory of formal languages has led to developments including the introduction of automatic groups [Ep+], hyperbolic groups [Gro], and geometric and language-theoretic characterizations of finitely generated virtually free groups [MS1] [MS2]. A prime example of such interplay is the study of combings, which ...

A Remark About Static Space Times

A Remark on a Remark by Macaulay or Enhancing Lazard Structural Theorem